ar X iv : c s / 06 06 05 1 v 1 [ cs . I T ] 1 2 Ju n 20 06 Minimum Pseudo - Weight and Minimum Pseudo - Codewords of LDPC Codes ∗
نویسنده
چکیده
In this correspondence, we study the minimum pseudo-weight and minimum pseudo-codewords of low-density parity-check (LDPC) codes under linear programming (LP) decoding. First, we show that the lower bound of Kelly, Sridhara, Xu and Rosenthal on the pseudo-weight of a pseudo-codeword of an LDPC code with girth greater than 4 is tight if and only if this pseudo-codeword is a real multiple of a codeword. Then, we show that the lower bound of Kashyap and Vardy on the stopping distance of an LDPC code is also a lower bound on the pseudo-weight of a pseudo-codeword of this LDPC code with girth 4, and this lower bound is tight if and only if this pseudo-codeword is a real multiple of a codeword. Using these results we further show that for some LDPC codes, there are no other minimum pseudo-codewords except the real multiples of minimum codewords. This means that the LP decoding for these LDPC codes is asymptotically optimal in the sense that the ratio of the probabilities of decoding errors of LP decoding and maximum-likelihood decoding approaches to 1 as the signal-to-noise ratio leads to infinity. Finally, some LDPC codes are listed to illustrate these results.
منابع مشابه
ar X iv : m at h / 06 06 67 1 v 1 [ m at h . A C ] 2 7 Ju n 20 06 PRÜFER ⋆ – MULTIPLICATION DOMAINS AND ⋆ – COHERENCE
متن کامل
ar X iv : h ep - t h / 05 06 19 5 v 1 2 3 Ju n 20 05 Geometric transitions and mixed Hodge structures
We formulate and prove a B-model disc level large N duality result for general conifold transitions between compact Calabi-Yau spaces using degenerations of Hodge structures.
متن کاملar X iv : m at h / 06 06 31 2 v 1 [ m at h . A C ] 1 3 Ju n 20 06 ASYMPTOTIC BEHAVIOR OF MULTIGRADED REGULARITY
Let S be a standard N k-graded polynomial ring over a field K, let I be a multigraded homogeneous ideal of S, and let M be a finitely generated Z k-graded S-module. We prove that the resolution regularity, a multigraded variant of Castelnuovo-Mumford regularity, of I n M is asymptotically a linear function. This shows that the well known Z-graded phenomenon carries to multigraded situation.
متن کاملar X iv : c s / 07 01 11 2 v 1 [ cs . I T ] 1 7 Ja n 20 07 ( l , s ) − Extension of Linear Codes
We construct new linear codes with high minimum distance d. In at least 12 cases these codes improve the minimum distance of the previously known best linear codes for fixed parameters n, k. Among these new codes there is an optimal ternary [88, 8, 54]3 code. We develop an algorithm, which starts with already good codes C , i.e. codes with high minimum distance d for given length n and dimensio...
متن کاملar X iv : h ep - p h / 05 06 28 4 v 1 2 8 Ju n 20 05 A variational method from the variance of energy
A variational method is studied based on the minimum of energy variance. The method is tested on exactly soluble problems in quantum mechanics, and is shown to be a useful tool whenever the properties of states are more relevant than the eigenvalues. In quantum field theory the method provides a consistent second order extension of the gaussian effective potential. Typeset using REVTEX
متن کامل